The Abella Interactive Theorem Prover (System Description)
نویسنده
چکیده
Abella [3] is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a two-level logic approach to specification and reasoning. One level is defined by a specification logic which supports a transparent encoding of structural semantics rules and also enables their execution. The second level, called the reasoning logic, embeds the specification logic and allows the development of proofs of properties about specifications. An important characteristic of both logics is that they exploit the λ-tree syntax approach to treating binding in object languages. Amongst other things, Abella has been used to prove normalizability properties of the λ-calculus, cut admissibility for a sequent calculus and type uniqueness and subject reduction properties. This paper discusses the logical foundations of Abella, outlines the style of theorem proving that it supports and finally describes some of its recent applications.
منابع مشابه
System Description: Abella -- A System for Reasoning about Computations
Abella [Gac08] is an interactive theorem prover for reasoning about the properties of an object language that is described through structural operational semantics style rules. Abella is based on a two-level logic approach to specification and reasoning. One level is defined by a specification logic which supports a transparent encoding of structural operational semantics rules and also enables...
متن کاملAutomating the Proofs of Strengthening Lemmas in the Abella Proof Assistant
In logical reasoning, it is often the case that only some of a collection of assumptions are needed to reach a conclusion. A strengthening lemma is an assertion that a given conclusion is independent in this sense of a particular assumption. Strengthening lemmas underlie many useful techniques for simplifying proofs in automated and interactive theorem-provers. For example, they underlie a mech...
متن کاملSystem Description: Leo – A Resolution based Higher-Order Theorem Prover
We present Leo, a resolution based theorem prover for classical higher-order logic. It can be employed as both an fully automated theorem prover and an interactive theorem prover. Leo has been implemented as part of the Ωmega environment [23] and has been integrated with the Ωmega proof assistant. Higher-order resolution proofs developed with Leo can be displayed and communicated to the user vi...
متن کاملUse of a Theorem Prover for Transformational Synthesis
Transformational synthesis is the process of generating a hardware implementation from an initial behavioural description, by repeatedly applying transformations to the behavioural descriptions until a satisfactory implementation can be generated. It is essential to verify the correctness of the applied transformations if the final implementation is to conform to the initial specification. We h...
متن کاملTranslating Timed I/O Automata Specifications for Theorem Proving in PVS
The timed input/output automaton modeling framework is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its statetransition based description has to be translated to the language of the theorem prover. This thesis describes ...
متن کامل